Minimum Average Cost Clustering
نویسندگان
چکیده
A number of objective functions in clustering problems can be described with submodular functions. In this paper, we introduce the minimum average cost criterion, and show that the theory of intersecting submodular functions can be used for clustering with submodular objective functions. The proposed algorithm does not require the number of clusters in advance, and it will be determined by the property of a given set of data points. The minimum average cost clustering problem is parameterized with a real variable, and surprisingly, we show that all information about optimal clusterings for all parameters can be computed in polynomial time in total. Additionally, we evaluate the performance of the proposed algorithm through computational experiments.
منابع مشابه
On the Clustering of Head-Related Transfer Functions Used for 3-D Sound Localization
Head-related transfer functions (HRTFs) serve the increasingly dominant role of implementation 3-D audio systems, which have been realized in some commercial applications. However, the cost of a 3-D audio system cannot be brought down because the efficiency of computation, the size of memory, and the synthesis of unmeasured HRTFs remain to be made better. This paper presents a way to moderate t...
متن کاملEnergy Saving in Kiln Unit of of ABYEK CEMENT CO: Data Clustering Approach
Cost of cement producing all over the world depends on to the level of wages, energy cost and availability of raw materials. By investigating financial statements of various companies at the stock market, the share of electrical and fuel costs are nearly 27 percent of total costs and this plays the important role in right management of energy consumption. In this regard mathematics modeling and...
متن کاملClustering Multidimensional Extended Objects to Speed Up Execution of Spatial Queries
We present a cost-based adaptive clustering method to improve average performance of spatial queries (intersection, containment, enclosure queries) over large collections of multidimensional extended objects (hyper-intervals or hyper-rectangles). Our object clustering strategy is based on a cost model which takes into account the spatial object distribution, the query distribution, and a set of...
متن کاملFinding the Minimum Distance from the National Electricity Grid for the Cost-Effective Use of Diesel Generator-Based Hybrid Renewable Systems in Iran
The electricity economy and its excessive consumption have become one of the main concerns of the Iranian government for many years. This issue, along with recent droughts, shows the need to use renewable energy that is free and clean and does not require water. In addition, due to the high cost of cable-laying and maintenance of power lines, it is not at all an option at all distances over the...
متن کاملSuper Paramagnetic Clustering of Data (spc)
1 Summary A new clustering algorithm named Super Paramagnetic Clustering (SPC) which was published by Blatt et al. 1]]2]]3] is described. The algorithm, which was rst motivated by properties of inhomogeneous magnets, is described as an outcome of a general technique to create robust clustering algorithms. The technique uses a clustering cost function and nds the average custering solution at di...
متن کامل